Abstract Concept Lattices
نویسندگان
چکیده
Concept Lattices Henry Soldano and Véronique Ventos 1 L.I.P.N, UMR-CNRS 7030, Université Paris-Nord, 93430 Villetaneuse, France 2 LRI, UMR-CNRS 8623, Université Paris-Sud, 91405 Orsay, France [email protected], [email protected] Abstract. We present a view of abstraction based on a structure preserving reduction of the Galois connection between a language L of terms and the powerset of a set of instances O. Such a relation is materialized as an extension-intension lattice, namely a concept lattice when L is the powerset of a set P of attributes. We define and characterize an abstraction A as some part of either the language or the powerset of O, defined in such a way that the extension-intension latticial structure is preserved. Such a structure is denoted for short as an abstract lattice. We discuss the extensional abstract lattices obtained by so reducing the powerset of O, together together with the corresponding abstract implications, and discuss alpha lattices as particular abstract lattices. Finally we give formal framework allowing to define a generalized abstract lattice whose language is made of terms mixing abstract and non abstract conjunctions of properties. We present a view of abstraction based on a structure preserving reduction of the Galois connection between a language L of terms and the powerset of a set of instances O. Such a relation is materialized as an extension-intension lattice, namely a concept lattice when L is the powerset of a set P of attributes. We define and characterize an abstraction A as some part of either the language or the powerset of O, defined in such a way that the extension-intension latticial structure is preserved. Such a structure is denoted for short as an abstract lattice. We discuss the extensional abstract lattices obtained by so reducing the powerset of O, together together with the corresponding abstract implications, and discuss alpha lattices as particular abstract lattices. Finally we give formal framework allowing to define a generalized abstract lattice whose language is made of terms mixing abstract and non abstract conjunctions of properties.
منابع مشابه
Similarity relations in concept lattices 1 RADIM BĚLOHLÁVEK
Abstract. Studied is the issue of similarity relations in fuzzy concept lattices. Fuzzy concepts and fuzzy concept lattices represent a formal approach to the modeling of non-sharp (fuzzy) concepts and conceptual structures in the sense of traditional (PortRoyal) logic. Applications of concept lattices are in representation of conceptual knowledge and in conceptual analysis of (fuzzy) data. Sim...
متن کاملOn generalized topological molecular lattices
In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...
متن کاملA Geometrical Heuristic for Drawing Concept Lattices
c Springer-Verlag Berlin{Heidelberg 1995 Abstract. Concept lattices are used in formal concept analysis to represent data conceptually so that the original data are still recognizable. Their line diagrams should reeect the semantical relationships within the data. Up to now, no satisfactory automatic drawing programs for this task exist. The geometrical heuristic is the most successful tool for...
متن کاملInterpretation of fuzzy attribute subsets in Generalized One-Sided Concept Lattices
Abstract In this paper we describe possible interpretation and reduction of fuzzy attributes in Generalized One-sided Concept Lattices (GOSCL). This type of concept lattices represent generalization of Formal Concept Analysis (FCA) suitable for analysis of data tables with different types of attributes. FCA as well as generalized one-sided concept lattices represent conceptual data mining metho...
متن کاملClosed Patterns and Abstraction Beyond Lattices
Recently pattern mining has investigated closure operators in families of subsets of an attribute set that are not lattices. In particular, various authors have investigated closure operators starting from a context, in the Formal Concept Analysis (FCA) sense, in which objects are described as usual according to their relation to attributes, and in which a closed element is a maximal element of...
متن کامل